Model and heuristic for berth allocation in tidal bulk ports with stock level constraints
نویسندگان
چکیده
We consider the problem of allocating berth positions for vessels in tidal bulk port terminals. A berth is defined as a specific location alongside a quay where a ship loader is available for loading or unloading vessels, accommodating only one vessel at a time. In tidal ports, draft conditions depend on high tide conditions, since available depth at low tide is not adequate for the movement of ships. Some port terminals are associated with important transnational enterprises which maintain strong control over the stock level of their goods. Since the stock level sometimes depends on a continuous process of consumption or production of minerals, the decision to load or unload vessels must consider the amount of the bulk cargo stored in the port yards. Therefore, a basic criterion for decision making is to give priority to the vessels related to the most critical mineral stock level. A second basic criterion is to decide what sequence of vessels reduces the overall demurrage within a given planning horizon. This paper presents an integer linear programming model based on the transportation problem to represent the Berth Allocation Problem in Tidal Bulk ports with Stock level conditions (BAPTBS). Problem instances are solved by a commercial solver and by a Simulated Annealing-based algorithm (SA). The SA employs a problem-specific heuristic, becoming a valid alternative for finding out good solutions for difficult instances. Preprint submitted to Elsevier 13 January 2011
منابع مشابه
Optimal Allocation of Ships to Quay Length in Container Ports
Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...
متن کاملFrom container terminals to bulk ports: models and algorithms for integrated planning and robust scheduling
In the operations research (OR) literature on port operations planning, there are a significant number of studies addressing decision problems in the context of container terminal management. Bulk terminals on the other hand, have been largely ignored. In this thesis, we study some of the key decision problems such as the berth allocation problem and the yard assignment problem in the bulk cont...
متن کاملIntegrated Berth Allocation and Yard Assignment in Bulk Ports using Column Generation
One of the primary modes for worldwide trade of goods is maritime transport, which is exposed to rapid growth. In order to handle the increase of the traffic in ports, optimization of port operations has been studied and implemented in the past. In container terminals, significant amount of work has been done in the field of large scale optimization. In published literature, the main focus lies...
متن کاملA new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)
Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...
متن کاملPii: S0191-2615(99)00057-0
This paper addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-eectiveness in Japan's ports. The berth allocation to calling ships is a key factor for ecient public berthing. However, it is not calculated in polynomially-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 60 شماره
صفحات -
تاریخ انتشار 2011